A Self-adaptive Algorithm for Topology Matching in Unstructured Peer-to-Peer Networks
نویسندگان
چکیده
منابع مشابه
A Scalable Search Algorithm for Unstructured Peer-to-Peer Networks
Scalability in a peer-to-peer network is a challenging problem. Unstructured peer-to-peer networks inherently lack scalability, and structured networks are inefficient for a high churn rate. In this paper, we present a scalable search algorithm for a decentralized unstructured peer-to-peer network using a method to dynamically determine the number of nodes to forward a query to at once. The dec...
متن کاملDynamic Search Algorithm used in Unstructured Peer-to-Peer Networks
Designing efficient search algorithms is a key challenge in unstructured peer-to-peer networks. Flooding and random walk (RW) are two typical search algorithms. Flooding searches aggressively and covers the most nodes. However, it generates a large amount of query messages and, thus, does not scale. On the contrary, RW searches conservatively. It only generates a fixed amount of query messages ...
متن کاملDynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Designing efficient search algorithms is a key challenge in unstructured peer-to-peer networks. Flooding and random walk (RW) are two typical search algorithms. Flooding searches aggressively and covers the most nodes. However, it generates a large amount of query messages and, thus, does not scale. On the contrary, RW searches conservatively. It only generates a fixed amount of query messages ...
متن کاملSelf Organizing Topology Transformation for Peer-To-Peer (P2P) Networks
Topological structure of peer-to-peer (P2P) networks affects their operating performance. Thus, various models have been proposed to construct an efficient topology for the P2P networks. However, due to the simultaneous failures of peers and other disastrous events, it is difficult to maintain the originally designed topological structure that provides the network with some performance benefits...
متن کاملBeyond anarchy: Self-organized topology for peer-to-peer networks
In this article, we discuss the new constraints that will apply to future, highly dynamic networks and investigate one of the major problems that is likely to affect their deployment: traffic/workload distribution. Starting with a very simple model, we demonstrate that a structure made of undifferentiated subunits will almost inevitably hit a scalability barrier, unless new design rules are app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Network and Systems Management
سال: 2015
ISSN: 1064-7570,1573-7705
DOI: 10.1007/s10922-015-9353-9